Bounds for Edge-Cover by Random Walks
نویسنده
چکیده
Let G = (m,n) be an undirected graph with m edges and n vertices. For a random walk on G it is known that the time to cover all its edges is bounded by O(mn) [2]. In a later work the bound O(m2) [3] is proved, which holds even for graphs with weighted edges. Here, we briefly discuss these results along with their proofs.
منابع مشابه
The Cover Time of Deterministic Random Walks
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this “deterministic random walk” covers all vertices (or all edges). We present general techniques to derive upper bounds for the vertex and edge cover time and derive matching lower bounds for several impo...
متن کاملRandom Walks on Colored Graphs
We initiate a study of random walks on undirected graphs with colored edges. In our model, a sequence of colors is speciied before the walk begins, and it dictates the color of edge to be followed at each step. We give tight upper and lower bounds on the expected cover time of a random walk on an undirected graph with colored edges. We show that, in general, graphs with two colors have exponent...
متن کاملThe Cover Time of Deterministic Random Walks for General Transition Probabilities
Abstract. The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk, nothing is known about the cover time of deterministic random walks emulating general transition probabilities. This paper is concerned with the SRT-rou...
متن کاملTight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the speed-up defined as the ratio between the cover time of one and the cover time of k random walks. Recently Alon et al. developed several bounds that are based on the quotient between the cover time and maximum hittin...
متن کاملCover Time in Edge-Uniform Stochastically-Evolving Graphs
We define a new model of stochastically evolving graphs, namely the Edge-Uniform Stochastic Graphs. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete time step of evolution following a (Markovian) stochastic rule. The stochastic rule is identical for each possible edge and may depend on the previous k ≥ 0 ob...
متن کامل